منابع مشابه
Non-Homogenizable Classes of Finite Structures
Homogenization is a powerful way of taming a class of finite structures with several interesting applications in different areas, from Ramsey theory in combinatorics to constraint satisfaction problems (CSPs) in computer science, through (finite) model theory. A few sufficient conditions for a class of finite structures to allow homogenization are known, and here we provide a necessary conditio...
متن کاملMathematical Logic Homogenizable structures and model completeness
A homogenizable structure M is a structure where we may add a finite number of new relational symbols to represent some ∅−definable relations in order to make the structure homogeneous. In this article we will divide the homogenizable structures into different classes which categorize many known examples and show what makes each class important. We will show that model completeness is vital for...
متن کاملRippling on Relational Structures
The rippling heuristic has been rather successfully used to guide inductive proofs in a functional framework. We present here how that heuristic can be formalized in a relational framework, more adapted to logic programming. The rippling heuristic is rst analysed to identify its key components. A formalization of these to a relational framework is then presented. The applicability and the power...
متن کاملCategories of relational structures
The paper characterises compositional homomorphims of relational structures. A detailed study of three categories of such structures { viewed as multialgebras { reveals the one with the most desirable properties. In addition, we study analogous categories with homomorphisms mapping elements to sets (thus being relations). Finally, we indicate some consequences of our results for partial algebra...
متن کاملHomomorphism-Homogeneous Relational Structures
We study relational structures (especially graphs and posets) which satisfy the analogue of homogeneity but for homomorphisms rather than isomorphisms. The picture is rather different. Our main results are partial characterisations of countable graphs and posets with this property; an analogue of Fraı̈ssé’s Theorem; and representations of monoids as endomorphism monoids of such structures. ∗This...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Illinois Journal of Mathematics
سال: 1990
ISSN: 0019-2082
DOI: 10.1215/ijm/1255988065